Minimum entangled state dimension required for pseudo-telepathy

نویسندگان

  • Gilles Brassard
  • André Allan Méthot
  • Alain Tapp
چکیده

Pseudo-telepathy provides an intuitive way of looking at Bell’s inequalities, in which it is often obvious that feats achievable by use of quantum entanglement would be classically impossible. A two-player pseudo-telepathy game proceeds as follows: Alice and Bob are individually asked a question and they must provide an answer. They are not allowed any form of communication once the questions are asked, but they may have agreed on a common strategy prior to the execution of the game. We say that they win the game if the questions and answers fulfil a specific relation. A game exhibits pseudo-telepathy if there is a quantum strategy that makes Alice and Bob win the game for all possible questions, provided they share prior entanglement, whereas it would be impossible to win this game systematically in a classical setting. In this paper, we show that any two-player pseudo-telepathy game requires the quantum players to share an entangled quantum system of dimension at least 3× 3. This is optimal for twoplayer games, but the most efficient pseudo-telepathy game possible, in terms of total dimension, involves three players who share a quantum system of dimension 2× 2× 2. Supported in part by the Natural Sciences and Engineering Research Council of Canada (Nserc), the Canadian Institute for Advanced Research (Ciar), the Mathematics of Information Technology and Complex Systems Network (Mitacs) and the Canada Research Chair Programme. Supported in part by Nserc, Ciar, Mitacs and Québec’s Fqrnt.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

4 Minimum entangled state dimension required for pseudo - telepathy

Pseudo-telepathy provides an intuitive way of looking at Bell’s inequalities, in which it is often obvious that feats achievable by use of quantum entanglement would be classically impossible. A two-player pseudo-telepathy game proceeds as follows: Alice and Bob are individually asked a question and they must provide an answer. They are not allowed any form of communication once the questions a...

متن کامل

Maximally Entangled State in Pseudo-Telepathy Games

A pseudo-telepathy game is a nonlocal game which can be won with probability one using some finite-dimensional quantum strategy but not using a classical one. Our central question is whether there exist two-party pseudo-telepathy games which cannot be won with probability one using a maximally entangled state. Towards answering this question, we develop conditions under which maximally entangle...

متن کامل

Two Party Pseudo Telepathy Games

In this work we have introduced two party pseudo telepathy games with respective winning conditions. One cannot win these games deterministically by any kind of classical protocols. Interestingly we find out that in quantum world, these winning conditions can be achieved if the players share an entangled state. We also introduced a game which is impossible to win if the players are form classic...

متن کامل

colouring pseudo - telepathy game and non - local box

Here we will discuss a winning strategy of impossible colouring pseudo-telepathy game for the set of vectors having KochenSpecker property in four dimension with single use of NLbox. Then we discuss some sufficient condition for the winning strategy of impossible colouring pseudo-telepathy game for general d-dimension with single use of NL-box.

متن کامل

On the power of non-local boxes

A non-local box is a virtual device that has the following property: given that Alice inputs a bit at her end of the device and that Bob does likewise, it produces two bits, one at Alice’s end and one at Bob’s end, such that the XOR of the outputs is equal to the AND of the inputs. This box, inspired from the CHSH inequality, was first proposed by Popescu and Rohrlich to examine the question: g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Quantum Information & Computation

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2005